A Marker Propagation Text Understanding and Inference System

نویسندگان

  • Dan I. Moldovan
  • Sanda M. Harabagiu
چکیده

Introduction This paper describes a natural language understanding system that is under development at the Southern Methodist University. The project, known as the SNAP project, started at the University of Southern California in late 1980’s. Our group participated in the Message Understanding Conferences (MUC-4 and -5) where the task was to extract information from thousands of real messages and fill in some predetermined templates. In this paper we describe the understanding and inference components of our system. A distinct feature of our system and an important innovation is the application of parallel processing to natural language. Another significant aspect is that we take a complete system approach that integrates many levels of language processing and aim at understanding unrestricted text. To facilitate the processing of unrestricted text, we use a knowledge base constructed on top of WordNet 1.5, the lexical database for English language developed at Princeton[Mil95].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Algorithm for Text Inference

In this paper we describe a highly parallel method for extracting inferences from text. The method is based on a marker-propagation algorithm that establishes semantic paths between knowledge base concepts. The paper presents the structure of the system, the marker-propagation algorithm, and results that show a large degree of parallelism.

متن کامل

Paris: a Parallel Inference System 1

This paper presents an inferential system based on abductive interpretation of text. Inference to the best explanation is performed by the recognition of the most economic semantic paths produced by the propagation of markers on a very large linguistic knowledge base. The propagation of markers is controlled by their intrinsic propagation rules, devised from plausible semantic relation chains. ...

متن کامل

Testing Gricean Constraints on a WordNet-based Coherence Evaluation System

This paper presents a computational method for analyzing Gricean constraints for the purpose of evaluating text coherence. Our system consists of a knowledge base constructed on top of WordNet, an inference engine that establishes discourse semantic paths between the input concepts and a mechanism of relating them to the context. Grice's maxims provide conditions to test coherence, while the se...

متن کامل

Parallel System for Text Inference Using Marker Propagations

This paper presents a possible solution for the text inference problem—extracting information unstated in a text, but implied. Text inference is central to natural language applications such as information extraction and dissemination, text understanding, summarization, and translation. Our solution takes advantage of a semantic English dictionary available in electronic form that provides the ...

متن کامل

A Marker { Propagation Algorithm for TextCoherence 1

Text coherence is a diicult problem in natural language processing. A text is considered to be coherent when sentences follow logically one after the other. In this paper we describe a computational method that provides an explanation why a text is coherent. By providing such an explanation, one can infer a number of assertions unstated in a text. Our computational method is based on a parallel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996